A Semantics for a Class of Stratified Production System Programs
نویسنده
چکیده
We present our research on defining a correct semantics for forward chaining production systems (PS) programs. A correct semantics must ensure that the execution of the program is deterministic and that it will terminate. We define a class of function-free stratified PS programs, and develop a fixpoint semantics and a declarative semantics for these programs. A stratified PS program comprises an initial extensional database (EDB init) of facts, and a set of productions. We define the conditions for the productions in the PS program to be stratified and we define an operator TPS, which computes the fixpoint for the productions of the stratified PS program. The fixpoint is represented by an updated database EDBn. A corresponding logic program PS dd is derived from the stratified PS program. PS dd is stratified and has a standard minimal model MPS dd. The declarative semantics for the PS program is given by this model MPS dd. We prove that the declarative semantics given by the model MPS dd for PS dd is equivalent to the fixpoint EDBn for the productions in the PS program.
منابع مشابه
Maintaining Consistency in a Stratified System Program
We present our research on defining a correct semantics for forward chaining production systems (PS) programs. A correct semantics ensures that the execution of the program will not produce incorrect answers and execution will terminate; it also ensures that the answers are consistent. We define a class of stratified PS programs, and propose an operational semantics for these programs. We defin...
متن کاملEquivalence of Well-Founded and Stable Semantics
We show that the well-founded semantics and the stable semantics are equivalent on the class of the order-consistent programs which is a strict super-class of the locally-stratified programs class and of the call-consistent programs class. (1) Université de Paris 1 90 rue de Tolbiac 75634 Paris cedex 13 FRANCE email: [email protected]
متن کاملStratified , Weak Stratified , and Three - valued Semantics ∗
We investigate the relationship between three-valued Kripke/Kleene semantics and stratified semantics for stratifiable logic programs. We first show these are compatible, in the sense that if the three-valued semantics assigns a classical truth value, the stratified approach will assign the same value. Next, the familiar fixed point semantics for pure Horn clause programs gives both smallest an...
متن کاملTranslation of Aggregate Programs to Normal Logic Programs
We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and stratified aggregate programs and show that the translation of such programs are, respectively, definite and stratified logic programs. Consequently these two classes of programs have a single partial stable model which is two-valued...
متن کاملInterrogation of a University Classrooms in the Court of Semantics: Managerial Implications
The purpose of this article, within the framework of an interpretive study, was to study the semantics of a universitychr('39')s classrooms to create a critical awareness of the meanings of the symptoms and their functions at the context of physical artifacts, besides their managerial implications. To accomplish this goal, after taking pictures of the structural elements of the studied classroo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Program.
دوره 21 شماره
صفحات -
تاریخ انتشار 1994